InforLorV4, Main, Exploration, bibRecord, 003171

Regaining cut admissibility in deduction modulo using abstract completion

Identifieur interne : 003171 ( Main/Exploration ); précédent : 003170; suivant : 003172

Regaining cut admissibility in deduction modulo using abstract completion

Auteurs : Guillaume Burel [France] ; Claude Kirchner [France]

Source :

Information and computation : (Print) [ 0890-5401 ] ; 2010.

RBID : Pascal:10-0105560

Descripteurs français

Pascal (Inist)
- Admissibilité, Complétion, Preuve, Règle inférence, Calcul séquent, Congruence, Déploiement, Procédure, Puissance, Démonstration théorème, Réécriture, Relation ordre, Informatique théorique, Déduction naturelle, 68T15, 68Q42, Système deductif.
Wicri :
- topic : Preuve.

English descriptors

KwdEn :
- Admissibility, Completion, Computer theory, Congruence, Deductive system, Inference rule, Ordering, Power, Procedure, Proof, Rewriting, Sequent calculus, Theorem proving, Unfolding.
mix :
- Automated deduction, Knuth-Bendix completion, abstract canonical system, computational proof, critical proofs, cut admissibility, deduction modulo, proof ordering, rewriting.

Abstract

Deduction modulo is a way to combine computation and deduction in proofs, by applying the inference rules of a deductive system (e.g. natural deduction or sequent calculus) modulo some congruence that we assume here to be presented by a set of rewrite rules. Using deduction modulo is equivalent to proving in a theory corresponding to the rewrite rules, and leads to proofs that are often shorter and more readable. However, cuts may be not admissible anymore. We define a new system, the unfolding sequent calculus, and prove its equivalence with the sequent calculus modulo, especially w.r.t. cut-free proofs. It permits to show that it is even undecidable to know if cuts can be eliminated in the sequent calculus modulo a given rewrite system. Then, to recover the cut admissibility, we propose a procedure to complete the rewrite system such that the sequent calculus modulo the resulting system admits cuts. This is done by generalizing the Knuth-Bendix completion in a non-trivial way, using the framework of abstract canonical systems. These results enlighten the entanglement between computation and deduction, and the power of abstract completion procedures. They also provide an effective way to obtain systems admitting cuts, therefore extending the applicability of deduction modulo in automated theorem proving.

Url:

https://hal.inria.fr/inria-00132964

Affiliations:

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Regaining cut admissibility in deduction modulo using abstract completion</title>
<author><name sortKey="Burel, Guillaume" sort="Burel, Guillaume" uniqKey="Burel G" first="Guillaume" last="Burel">Guillaume Burel</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Nancy-Université, Université Henri Poincaré, Faculté des sciences et techniques, Campus Victor Grignard, BP 70239</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
<orgName type="university">Nancy-Université</orgName>
</affiliation>
<affiliation wicri:level="3"><inist:fA14 i1="03"><s1>LORIA, Équipe Pareo, Bâtiment B, Campus Scientifique, BP239</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, 351 cours de la Libération, Bâtiment A29</s1>
<s2>33405 Talence</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Nouvelle-Aquitaine</region>
<region type="old region" nuts="2">Aquitaine</region>
<settlement type="city">Talence</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><inist:fA14 i1="03"><s1>LORIA, Équipe Pareo, Bâtiment B, Campus Scientifique, BP239</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">10-0105560</idno>
<date when="2010">2010</date>
<idno type="stanalyst">PASCAL 10-0105560 INIST</idno>
<idno type="RBID">Pascal:10-0105560</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000232</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000786</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000170</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000170</idno>
<idno type="wicri:doubleKey">0890-5401:2010:Burel G:regaining:cut:admissibility</idno>
<idno type="wicri:Area/Main/Merge">003233</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00132964</idno>
<idno type="url">https://hal.inria.fr/inria-00132964</idno>
<idno type="wicri:Area/Hal/Corpus">004066</idno>
<idno type="wicri:Area/Hal/Curation">004066</idno>
<idno type="wicri:Area/Hal/Checkpoint">002702</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002702</idno>
<idno type="wicri:doubleKey">0890-5401:2010:Burel G:regaining:cut:admissibility</idno>
<idno type="wicri:Area/Main/Merge">002E99</idno>
<idno type="wicri:Area/Main/Curation">003171</idno>
<idno type="wicri:Area/Main/Exploration">003171</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Regaining cut admissibility in deduction modulo using abstract completion</title>
<author><name sortKey="Burel, Guillaume" sort="Burel, Guillaume" uniqKey="Burel G" first="Guillaume" last="Burel">Guillaume Burel</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Nancy-Université, Université Henri Poincaré, Faculté des sciences et techniques, Campus Victor Grignard, BP 70239</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
<orgName type="university">Nancy-Université</orgName>
</affiliation>
<affiliation wicri:level="3"><inist:fA14 i1="03"><s1>LORIA, Équipe Pareo, Bâtiment B, Campus Scientifique, BP239</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA, Centre de Recherche INRIA Bordeaux - Sud-Ouest, 351 cours de la Libération, Bâtiment A29</s1>
<s2>33405 Talence</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Nouvelle-Aquitaine</region>
<region type="old region" nuts="2">Aquitaine</region>
<settlement type="city">Talence</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><inist:fA14 i1="03"><s1>LORIA, Équipe Pareo, Bâtiment B, Campus Scientifique, BP239</s1>
<s2>54506 Vandœuvre-lés-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Vandœuvre-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Information and computation : (Print)</title>
<title level="j" type="abbreviated">Inf. comput. : (Print)</title>
<idno type="ISSN">0890-5401</idno>
<imprint><date when="2010">2010</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Information and computation : (Print)</title>
<title level="j" type="abbreviated">Inf. comput. : (Print)</title>
<idno type="ISSN">0890-5401</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Admissibility</term>
<term>Completion</term>
<term>Computer theory</term>
<term>Congruence</term>
<term>Deductive system</term>
<term>Inference rule</term>
<term>Ordering</term>
<term>Power</term>
<term>Procedure</term>
<term>Proof</term>
<term>Rewriting</term>
<term>Sequent calculus</term>
<term>Theorem proving</term>
<term>Unfolding</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Admissibilité</term>
<term>Complétion</term>
<term>Preuve</term>
<term>Règle inférence</term>
<term>Calcul séquent</term>
<term>Congruence</term>
<term>Déploiement</term>
<term>Procédure</term>
<term>Puissance</term>
<term>Démonstration théorème</term>
<term>Réécriture</term>
<term>Relation ordre</term>
<term>Informatique théorique</term>
<term>Déduction naturelle</term>
<term>68T15</term>
<term>68Q42</term>
<term>Système deductif</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Preuve</term>
</keywords>
<keywords scheme="mix" xml:lang="en"><term>Automated deduction</term>
<term>Knuth-Bendix completion</term>
<term>abstract canonical system</term>
<term>computational proof</term>
<term>critical proofs</term>
<term>cut admissibility</term>
<term>deduction modulo</term>
<term>proof ordering</term>
<term>rewriting</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Deduction modulo is a way to combine computation and deduction in proofs, by applying the inference rules of a deductive system (e.g. natural deduction or sequent calculus) modulo some congruence that we assume here to be presented by a set of rewrite rules. Using deduction modulo is equivalent to proving in a theory corresponding to the rewrite rules, and leads to proofs that are often shorter and more readable. However, cuts may be not admissible anymore. We define a new system, the unfolding sequent calculus, and prove its equivalence with the sequent calculus modulo, especially w.r.t. cut-free proofs. It permits to show that it is even undecidable to know if cuts can be eliminated in the sequent calculus modulo a given rewrite system. Then, to recover the cut admissibility, we propose a procedure to complete the rewrite system such that the sequent calculus modulo the resulting system admits cuts. This is done by generalizing the Knuth-Bendix completion in a non-trivial way, using the framework of abstract canonical systems. These results enlighten the entanglement between computation and deduction, and the power of abstract completion procedures. They also provide an effective way to obtain systems admitting cuts, therefore extending the applicability of deduction modulo in automated theorem proving.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Aquitaine</li>
<li>Grand Est</li>
<li>Lorraine (région)</li>
<li>Nouvelle-Aquitaine</li>
</region>
<settlement><li>Talence</li>
<li>Vandœuvre-lès-Nancy</li>
</settlement>
<orgName><li>Nancy-Université</li>
</orgName>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Burel, Guillaume" sort="Burel, Guillaume" uniqKey="Burel G" first="Guillaume" last="Burel">Guillaume Burel</name>
</region>
<name sortKey="Burel, Guillaume" sort="Burel, Guillaume" uniqKey="Burel G" first="Guillaume" last="Burel">Guillaume Burel</name>
<name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003171 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003171 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Pascal:10-0105560
   |texte=   Regaining cut admissibility in deduction modulo using abstract completion
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

Regaining cut admissibility in deduction modulo using abstract completion

Regaining cut admissibility in deduction modulo using abstract completion

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.